Wavelet Rasterization
نویسندگان
چکیده
We present a method for analytically calculating an anti-aliased rasterization of arbitrary polygons or fonts bounded by Bézier curves in 2D as well as oriented triangle meshes in 3D. Our algorithm rasterizes multiple resolutions simultaneously using a hierarchical wavelet representation and is robust to degenerate inputs. We show that using the simplest wavelet, the Haar basis, is equivalent to performing a box-filter to the rasterized image. Because we evaluate wavelet coefficients through line integrals in 2D, we are able to derive analytic solutions for polygons that have Bézier curve boundaries of any order, and we provide solutions for quadratic and cubic curves. In 3D, we compute the wavelet coefficients through analytic surface integrals over triangle meshes and show how to do so in a computationally efficient manner.
منابع مشابه
3D rasterization: a bridge between rasterization and ray casting
Ray tracing and rasterization have long been considered as two fundamentally different approaches to rendering images of 3D scenes, although they compute the same results for primary rays. Rasterization projects every triangle onto the image plane and enumerates all covered pixels in 2D, while ray tracing operates in 3D by generating rays through every pixel and then finding the closest interse...
متن کامل3D Rasterization – Unifying Rasterization and Ray Casting
Ray tracing and rasterization have long been considered as two very different approaches to rendering images of 3D scenes that – while computing the same results for primary rays – lie at opposite ends of a spectrum. While rasterization first projects every triangle onto the image plane and enumerates all covered pixels in 2D, ray tracing operates in 3D by generating rays through every pixel an...
متن کاملSupercover plane rasterization - a rasterization algorithm for generating supercover plane inside a cube
An analysis of a rasterization algorithm for generating supercover planes in 3D voxel space is presented. The derived algorithm is an extension to the classical 2D line rasterization algorithm. Additional voxels needed to form the supercover 3D plane are identified by rasterizing two additional 2D lines per volume slice. A discussion on how to modify the algorithm to rasterize finite supercover...
متن کاملRecent developments in ray tracing for video games
Since the emerging of 3D video games, polygon rasterization has become the industry standard for projecting worlds onto the screen. As time progressed, graphics accelerators and other hardware was developed to accelerate the process of rendering polygons as games demanded increasingly complex scenes and lighting. And while there are good reasons to stick to conventional rasterization, a rapid i...
متن کاملHybrid Sample-based Surface Rendering
The performance of rasterization-based rendering on current GPUs strongly depends on the abilities to avoid overdraw and to prevent rendering triangles smaller than the pixel size. Otherwise, the rates at which highresolution polygon models can be displayed are affected significantly. Instead of trying to build these abilities into the rasterization-based rendering pipeline, we propose an alter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 30 شماره
صفحات -
تاریخ انتشار 2011